Decision Procedures for Inductive Boolean Functions Based on Alternating Automata
نویسندگان
چکیده
We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds for deciding the equality of function (or circuit) families and show how our decision procedures can be implemented using BDDs. In comparison to previous work, our approach is simpler, has better complexity bounds, and, in the case of tree-structured families, is more general. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
A Good Class of Tree Automata and Application to Inductive Theorem Proving
We deene a new class of constrained tree automata to deal with terms containing syntactical functions and interpreted ones. First we deene an abstract class of automata with constrained rules which enjoys boolean closure properties, then we specialize the class for the case of multisets and the case of non-negative integers. In each case we give a decision procedure for the emptiness of the lan...
متن کاملUnconventional Finite Automata and Algorithms
We investigate several unconventional models of finite automata and algorithms. We show that two-way alternating automata can be smaller than fast bounded-error probabilistic automata. We introduce ultrametric finite automata which use p-adic numbers to describe the branching process of the computation. We examine the size complexity of all the abovementioned automata for the counting problem. ...
متن کاملLanguage Containment Checking with Nondeterministic BDDs
Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for language containment checking between two Büchi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the specification automaton as an alternating automaton. We prese...
متن کاملA Symbolic Decision Procedure for Symbolic Alternating Finite Automata
We introduce Symbolic Alternating Finite Automata (S-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over S-AFAs have linear complexity, which is in sharp contrast with the quadratic cost of intersection and union for non-alternating symbolic automata. Due to this succinctness, emptiness and equivalence ch...
متن کاملSatisfiability and Finite Model Property for the Alternating-Time mu-Calculus
This paper presents a decision procedure for the alternatingtime μ-calculus. The algorithm is based on a representation of alternating-time formulas as automata over concurrent game structures. We show that language emptiness of these automata can be checked in exponential time. The complexity of our construction meets the known lower bounds for deciding the satisfiability of the classic μ-calc...
متن کامل